Gaussian classical-quantum channels: Gain from entanglement-assistance
نویسندگان
چکیده
منابع مشابه
Classical capacities of quantum channels with environment assistance
A quantum channel physically is a unitary interaction between the information carrying system and an environment, which is initialized in a pure state before the interaction. Conventionally, this state, as also the parameters of the interaction, is assumed to be fixed and known to the sender and receiver. Here, following the model introduced by us earlier [Karumanchi et al., arXiv[quant-ph]:140...
متن کاملAdditivity of the Classical Capacity of Entanglement-Breaking Quantum Channels
Abstract We show that for the tensor product of an entanglement-breaking quantum channel with an arbitrary quantum channel, both the minimum entropy of an output of the channel and the Holevo-Schumacher-Westmoreland capacity are additive. In addition, for the tensor product of two arbitrary quantum channels, we give a bound involving entanglement of formation for the amount of subadditivity (fo...
متن کاملEntanglement-Assisted Classical Capacity of Noisy Quantum Channels
Prior entanglement between sender and receiver, which exactly doubles the classical capacity of a noiseless quantum channel, can increase the classical capacity of some noisy quantum channels by an arbitrarily large constant factor depending on the channel, relative to the best known classical capacity achievable without entanglement. The enhancement factor is greatest for very noisy channels, ...
متن کاملQuantum entanglement beyond Gaussian criteria.
Most of the attention given to continuous variable systems for quantum information processing has traditionally been focused on Gaussian states. However, non-Gaussianity is an essential requirement for universal quantum computation and entanglement distillation, and can improve the efficiency of other quantum information tasks. Here we report the experimental observation of genuine non-Gaussian...
متن کاملClassical complexity and quantum entanglement
Generalizing a decision problem for bipartite perfect matching, Edmonds (J. Res. Natl. Bur. Standards 718(4) (1967) 242) introduced the problem (now known as the Edmonds Problem) of deciding if a given linear subspace ofM(N) contains a non-singular matrix, whereM(N) stands for the linear space of complexN ×N matrices. This problem led to many fundamental developments in matroid theory, etc. Cla...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Problems of Information Transmission
سال: 2014
ISSN: 0032-9460,1608-3253
DOI: 10.1134/s0032946014010013